Heuristically Tuned GA to Solve Genome Fragment Assembly Problem [CEC7600]

نویسندگان

  • Satoko Kikuchi
  • Goutam Chakraborty
چکیده

We proposed a genetic algorithm (GA) approach to solve the genome sequencing problem. The main contribution of this work is to add two ideas to improve the efficiency of the algorithm (1) a Chromosome Reduction Step (CRed) method to shorten the length of the chromosome and thereby the searchspace, and (2) Chromosome Refinement Step (CRef) is a greedy heuristics to locally improve the fitness of chromosomes. The algorithm will bring out longer and longer contigs with shorter and shorter gaps, as it continues running. At any stage the user can view the result, stop it when the output serves her/his purpose, or continue for getting longer contigs. We ran the proposed algorithm on part of the Wolbachia project work, and compared the results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Seeding strategies and recombination operators for solving the DNA fragment assembly problem

a r t i c l e i n f o a b s t r a c t The fragment assembly problem consists in building the DNA sequence from several hundreds (or even, thousands) of fragments obtained by biologists in the laboratory. This is an important task in any genome project since the rest of the phases depend on the accuracy of the results of this stage. Therefore, accurate and efficient methods for handling this pro...

متن کامل

A cost-oriented model for multi-manned assembly line balancing problem

In many real world assembly line systems which the work-piece is of large size more than one worker work on the same work-piece in each station. This type of assembly line is called multi-manned assembly line (MAL). In the classical multi-manned assembly line balancing problem (MALBP) the objective is to minimize the manpower needed to manufacture one product unit. Apart from the manpower, othe...

متن کامل

A Hybrid Unconscious Search Algorithm for Mixed-model Assembly Line Balancing Problem with SDST, Parallel Workstation and Learning Effect

Due to the variety of products, simultaneous production of different models has an important role in production systems. Moreover, considering the realistic constraints in designing production lines attracted a lot of attentions in recent researches. Since the assembly line balancing problem is NP-hard, efficient methods are needed to solve this kind of problems. In this study, a new hybrid met...

متن کامل

Fuzzy PID Tuned by a Multi-Objective Algorithm to Solve Load Frequency Control Problem

Abstract In this paper, a fuzzy PID with new structure is proposed to solve the load frequency control in interconnected power systems. in this study, a new structure and effective of the fuzzy PID-type Load frequency control (LFC) is proposed to solve the load frequency control in interconnected power systems. The main objective is to eliminate the deviations in the frequency of different area...

متن کامل

Particle swarm optimization for minimizing total earliness/tardiness costs of two-stage assembly flowshop scheduling problem in a batched delivery system

This paper considers a two-stage assembly flow shop scheduling problem. When all parts of each product are completed in the first stage, they are assembled into a final product on an assembly machine in the second stage. In order to reduce the delivery cost, completed products can be held until completion of some other products to be delivered in a same batch. The proposed problem addresses sch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006